Fast Code Enhancement with Local Search for Fractal Image Compression
نویسندگان
چکیده
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is an NP-hard combinatorial optimization problem. Conventional coding is based on a greedy suboptimal algorithm known as collage coding. In a previous study, we proposed a local search algorithm that significantly improves on collage coding. However, the algorithm, which requires the computation of many fixed points, is computationally expensive. In this paper, we provide techniques that drastically reduce the time complexity of the algorithm.
منابع مشابه
Fast pyramidal search for perceptually based fractal image compression
In this paper, we present a fast algorithm for perceptually based fractal image compression. The algorithm is based on a refinement of the fractal code from an initial coarse level of a pyramid. Assuming the block matching error is modeled as a first order Laplacian autoregressive process, we derive the threshold sequence for the objective function in each pyramidal level. Computational efficie...
متن کاملLocal Search Fractal Image Compression for Fast Integrated Implementation
| The well known drawback of fractal image coding is its heavy computation complexity. In this paper, we show however that only a very small portion of this complexity is needed to encode the contours and the smooth areas of the objects of a certain minimum size. This is simply achieved by a local search of the matching domain blocks without isometry. Therefore, instead of forcing the fractal c...
متن کاملA.r. Nadira Banu Kamal and S. Thamarai Selvi: Enhanced Iteration-free Fractal Image Coding Algorithm with Efficient Search and Storage Space
An enhanced iteration free fractal algorithm is proposed in this research paper to design an efficient domain pool for image compression. The proposed methodology reduces the coding process time, intensive computation tasks and also the memory requirements. The redundancies in the domain pool are reduced by the Linde Buzo Gray (LBG) Algorithm. For each range block, vector features such as mean ...
متن کاملEfficient Fractal Image Coding using Fast Fourier Transform
The fractal coding is a novel technique for image compression. Though the technique has many attractive features, the large encoding time makes it unsuitable for real time applications. In this paper, an efficient algorithm for fractal encoding which operates on entire domain image instead of overlapping domain blocks is presented.The algorithm drastically reduces the encoding time as compared ...
متن کاملGenetic Algorithm Applied to Fractal Image Compression
In this paper the technique of Genetic Algorithm (GA) is applied for Fractal Image Compression (FIC). With the help of this evolutionary algorithm effort is made to reduce the search complexity of matching between range block and domain block. One of the image compression techniques in the spatial domain is Fractal Image Compression but the main drawback of FIC is that it involves more computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000